A Parallel Algorithm For Computing Fourier Transforms On the Star Graph
نویسندگان
چکیده
Abstmcr-The n-star graph, denoted by S,, is one of the graph networks that have been recently proposed as attractive alternatives to the n-cube topology for interconnecting processors in parallel computers. In this paper, we present a parallel algorithm for the computation of the Fourier transform on the star graph. The algorithm requires O(n*)multiply-add steps for an input sequence of n! elements, and is hence cost-optimal with respect to the sequential algorithm on which it is based. To the best of our knowledge, this is the first algorithm, and the only one to date, for the computation of the Fourier transform on the star graph.
منابع مشابه
Parallel Three-Dimensional Nonequispaced Fast Fourier Transforms and Their Application to Particle Simulation
In this paper we describe a parallel algorithm for calculating nonequispaced fast Fourier transforms on massively parallel distributed memory architectures. These algorithms are implemented in an open source software library called PNFFT. Furthermore, we derive a parallel fast algorithm for the computation of the Coulomb potentials and forces in a charged particle system, which is based on the ...
متن کاملImplementing 2-d and 3-d Discrete Hartley Transforms on a Massively Parallel Simd Mesh Computer
Discrete Hartley transform (DHT) is known to outperform fast Fourier transform (FFT) on sequential machines. Here we investigate parallel algorithms and implementations of twoand three-dimensional DHT in order to determine if the advantage of Hartley transforms over Fourier transforms carries over to parallel environment as well. Our extensive empirical study of the performances of DHT and FFT ...
متن کاملGreen Energy-aware task scheduling using the DVFS technique in Cloud Computing
Nowdays, energy consumption as a critical issue in distributed computing systems with high performance has become so green computing tries to energy consumption, carbon footprint and CO2 emissions in high performance computing systems (HPCs) such as clusters, Grid and Cloud that a large number of parallel. Reducing energy consumption for high end computing can bring various benefits such as red...
متن کاملMulti-Node Broadcasting in Hypercubes and Star Graphs
Technological advances have made building complicated large-scale multicomputer networks possible. The binary hypercube [7] is undoubtedly one of the most popular interconnection networks for parallel processing. Another candidate is the star graph [1], which has been recognized as an attractive alternative to the hypercube. A large number of researches have studied the star graph, focusing on ...
متن کاملComputing the Fast Fourier Transform on a Vector Computer
Two algorithms are presented for performing a Fast Fourier Transform on a vector computer and are compared on the Control Data Corporation STAR-100. The relative merits of the two algorithms are shown to depend upon whether only a few or many independent transforms are desired. A theorem is proved which shows that a set of independent transforms can be computed by performing a partial transform...
متن کامل